Invited talk: Algorithms for Geometric Similarity
نویسنده
چکیده
A basic problem in classifying, or searching for similar objects in, a large set of geometric objects is computing similarity between two objects. This has led to extensive work on computing geometric similarity between two objects. This talk discusses some old and some new geometric-similarity algorithms, with an emphasis on transportation distance (also called earth mover’s distance) and Frechet distance. The talk will also touch upon a few open problems in this area.
منابع مشابه
Evaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملA Geometric View of Similarity Measures in Data Mining
The main objective of data mining is to acquire information from a set of data for prospect applications using a measure. The concerning issue is that one often has to deal with large scale data. Several dimensionality reduction techniques like various feature extraction methods have been developed to resolve the issue. However, the geometric view of the applied measure, as an additional consid...
متن کاملSimilarity Patterns in Words (Invited talk)
Words are important both in historical linguistics and natural language processing. They are not indivisible abstract atoms; much can be gained by considering smaller units such as morphemes, phonemes, syllables, and letters. In this presentation, I attempt to sketch the similarity patterns among a number of diverse research projects in which I participated.
متن کاملPath Dependent Information Retrieval (invited talk)
I will present an analysis of how path dependent IR is support in the Ostensive Model for retrieval. It will involve a discussion of appropriate similarity measures and an explanation of how to predict and present a choice of objects for a user in terms of the path traversed in the object (or interpretation) space.
متن کاملRNA-Folding - From Hardness to Algorithms
This is an overview of the invited talk delivered at the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS-2016). 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
متن کامل